A Method for Deciding the Finiteness of Synchronous, Tabled Picture Languages
نویسنده
چکیده
In the present paper, synchronous, tabled chain code picture systems based on Lindenmayer systems (sT0L systems) are studied with respect to the finiteness of their picture languages. The finiteness is proved to be decidable. Additionally, a method is given for deciding whether an sT0L system generates a finite picture language or not.
منابع مشابه
The finiteness of synchronous, tabled picture languages is decidable
In the present paper, synchronous, tabled chain code picture systems based on Lindenmayer systems (sT0L system) are studied with respect to the finiteness of their picture languages. The finiteness is proved to be decidable. Additionally, a method is given for deciding whether or not an sT0L system generates a finite picture language. © 2006 Elsevier B.V. All rights reserved.
متن کاملOn the Finiteness of Picture Languages of Synchronous Deterministic Chain Code Picture Systems
Chain Code Picture Systems are Lindenmayer systems over a special alphabet. The strings generated are interpreted as pictures. This leads to Chain Code Picture Languages. In this paper, synchronous deterministic Chain Code Picture Systems (sD0L systems) are studied with respect to the finiteness of their picture languages. First, a hierarchy of abstractions is developed, in which the interpreta...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملA Comparative Study on Adjunct Array Token Petri Nets with Some Classes of Array Grammars
Adjunct Array Token Petri Net Structures (AATPNS) are recently introduced rectangular picture generating devices which extended the Array token Petri net Structures. AATPNS generated context free and context sensitive kolam array languages and tabled 0L/1L languages. In this paper we compare AATPNS with some simple and expressive picture grammar models like extended pure 2D context-free grammar...
متن کاملModeling different decision strategies in a time tabled multimodal route planning by integrating the quantifier-guided OWA operators, fuzzy AHP weighting method and TOPSIS
The purpose of Multi-modal Multi-criteria Personalized Route Planning (MMPRP) is to provide an optimal route between an origin-destination pair by considering weights of effective criteria in a way this route can be a combination of public and private modes of transportation. In this paper, the fuzzy analytical hierarchy process (fuzzy AHP) and the quantifier-guided ordered weighted averaging (...
متن کامل